Group Centrality for Semantic Networks: a SWOT analysis featuring Random Walks
نویسندگان
چکیده
Group centrality is an extension of the classical notion of centrality for individuals, to make it applicable to sets of them. We perform a SWOT (strengths, weaknesses, opportunities and threats) analysis of the use of group centrality in semantic networks, for different centrality notions: degree, closeness, betweenness, giving prominence to random walks. Among our main results stand out the relevance and NPhardness of the problem of finding the most central set in a semantic network for an specific centrality measure.
منابع مشابه
Non-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملLocal search on protein residue networks
Self-avoiding random walks were performed on protein residue networks. Compared with protein residue networks with randomized links, the probability of a walk being successful is lower and the length of successful walks shorter in (non-randomized) protein residue networks. Fewer successful walks and shorter successful walks point to higher communication specificity between protein residues, a c...
متن کاملMaximal-entropy random walk unifies centrality measures
This paper compares a number of centrality measures and several (dis-)similarity matrices with which they can be defined. These matrices, which are used among others in community detection methods, represent quantities connected to enumeration of paths on a graph and to random walks. Relationships between some of these matrices are derived in the paper. These relationships are inherited by the ...
متن کاملRandom walks on complex networks.
We investigate random walks on complex networks and derive an exact expression for the mean first-passage time (MFPT) between two nodes. We introduce for each node the random walk centrality C, which is the ratio between its coordination number and a characteristic relaxation time, and show that it determines essentially the MFPT. The centrality of a node determines the relative speed by which ...
متن کاملAutomatic discovery of case-specific relevant subgraphs in large scale signaling networks using random walks
We present a method to discover signaling pathways, quantify the relationship of preselected source/target nodes, and extract relevant subgraphs in large scale biological networks. This is demonstrated over the hepatocyte growth factor (HGF) stimulated cell migration and proliferation in a keratinocyte-fibroblast co-culture. The algorithm (MCWalk) is implemented with random walks using Monte Ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1601.00139 شماره
صفحات -
تاریخ انتشار 2016